Resolution cannot polynomially simulate compressed-BFS
نویسندگان
چکیده
منابع مشابه
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many diierent ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. 12] and 9]). Others use so-called binary decision diagrams (BDDs) 2, 10]. Experimental evidence suggests that BDDs and resolution based techniques are fundamentally diierent, in the sense that their performance can diier very much on benchmarks 14]. In th...
متن کاملResolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called binary decision diagrams (BDDs) [2, 10]. Experimental evidence suggests that BDDs and resolution based techniques are fundamentally different, in the sense that their performance can differ very much on benchmarks [14]...
متن کاملReportrapport Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many di erent ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called binary decision diagrams (BDDs) [2, 10]. Experimental evidence suggests that BDDs and resolution based techniques are fundamentally di erent, in the sense that their performance can di er very much on benchmarks [14]. I...
متن کاملQuantum Communication Cannot Simulate a Public Coin
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large class of efficient classical public-coin protocols can be turned into efficient quantum protocols without public coin. This raises the question whether this can be done always, i.e. whether quantum communication can alwa...
متن کاملCounting Axioms Do Not Polynomially Simulate Counting Gates
For every prime m ≥ 2, we give a family of tautologies that require super-polynomial size constant-depth Frege proofs from Countm axioms, and whose algebraic translations have constant-degree, polynomial size polynomial calculus refutations over Zm. This shows that constant-depth Frege systems with counting axioms modulo m do not polynomially simulate constant-depth Frege systems with counting ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics and Artificial Intelligence
سال: 2005
ISSN: 1012-2443,1573-7470
DOI: 10.1007/s10472-004-8427-2